Graph-Theoretic Solutions to Computational Geometry Problems
نویسنده
چکیده
Many problems in computational geometry are not stated in graphtheoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripification, angle optimization in tilings, and metric embedding from this perspective.
منابع مشابه
Enhancing Computational Promise of Neural Optimization for Graph-Theoretic Problems in Real-Time Environments
This paper demonstrates enhanced utility of neural static optimization algorithms for graph-theoretic problems in real-time environments under the assumption that fast computation cycles for near-optimal solutions are desirable. It assumes that a hardware realization of the neural optimization algorithm, which is then likely to fully exploit the high-degree of parallelism inherent to such optim...
متن کاملOn some applications of graph theory, I
In a series of papers, of which the present one is Part I, it is shown that solutions to a variety of problems in distance geoinetry, potential theory and theory of metric spaces arc provided by appropriate applications of graph theoretic results. §1 In what follows we are going to discuss systematic applications of graph theory-among others-to geometry, to potential theory, and to the theory o...
متن کاملHigher-Dimensional Packing with Order Constraints
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. Thi...
متن کاملSubtitle a Comparison of Approaches for Solving Hard Graph - Theoretic Problems
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computationa...
متن کاملOrdered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms
We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton–Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as “Ordered Upwind Methods” (OUMs), use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009